A silent duel over a cake

A silent battle over a cake

The division of a cake by n players is modeled as a game of timing. We show that such games admit a unique Nash equilibrium.

A Short Solution to the Many-Player Silent Duel with Arbitrary Consolation Prize

The classical constant-sum ‘silent duel’ game had two antagonistic marksmen walking towards each other. A more friendly formulation has two equally skilled marksmen approaching targets at which they may silently fire at distances of their own choice. The winner, who gets a unit prize, is the marksman who hits his target at the greatest distance; if both miss, they share the prize (each gets a ‘...

Prediction of Electricity Generation in a Duel Chamber Microbial Fuel Cell

Noisy fighter-bomber duel

The classical duel is a zero-sum game of two players of the following type. The players have certain resources and use them during a given time interval with the goal of achieving success. Use of the resource γ at the moment t leads to success with the probability depending on the amount of resource γ and the time t only (it is usually assumed that the probability of success increases with time...

A Very High Level Debugging Language

Programmers spend a significant part of their time debugging, yet most of them simply add print statements and avoid debugging tools. Although the user interface of debuggers has improved significantly in the past decade, their basic debugging methodologies have changed little. This thesis examines single-process sequential debuggers and attempts to elucidate their weaknesses. Target-state expl...